Assigning Objects to Classes of a Euclidean Ascending Hierarchical Clustering
نویسندگان
چکیده
In a Euclidean hierarchical ascending clustering (HAC,Ward’s method), the usual method for allocating a supplementary object to a cluster is based on the geometric distance from the object-point to the barycenter of the cluster. The main drawback of this method is that it does not take into consideration that clusters differ as regards weights, shapes and dispersions. Neither does it take into account successive dichotomies of the hierarchy of clustering. This is why we propose a new ranking rule adapted to geometric data analysis that takes the shape of clusters into account. From a set of supplementary objects, we propose a strategy for assigning these objects to clusters stemming from a ahc. The idea is to assign supplementary objects at the local level of a node to one of its two successors until a cluster of the partition under study is reached. We define an allocation criterion based on the ratio of Mahalanobis distances from the object–point to barycenters of the two clusters that make up the node. We first introduce the principle of the method, and we apply it to a barometric survey carried out by the cevipof on various components of trust among French citizens. We compare the evolution of clusters of individuals between 2009 and 2012 then 2013.
منابع مشابه
Grouping Objects to Homogeneous Classes Satisfying Requisite Mass
Grouping datasets plays an important role in many scientific researches. Depending on data features and applications, different constrains are imposed on groups, while having groups with similar members is always a main criterion. In this paper, we propose an algorithm for grouping the objects with random labels, nominal features having too many nominal attributes. In addition, the size constra...
متن کاملA Clustering Approach by SSPCO Optimization Algorithm Based on Chaotic Initial Population
Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. SSPCO optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. One of the things that smart algorithms are applied to solve is the problem ...
متن کاملRobust Method for E-Maximization and Hierarchical Clustering of Image Classification
We developed a new semi-supervised EM-like algorithm that is given the set of objects present in eachtraining image, but does not know which regions correspond to which objects. We have tested thealgorithm on a dataset of 860 hand-labeled color images using only color and texture features, and theresults show that our EM variant is able to break the symmetry in the initial solution. We compared...
متن کاملHierarchical Clustering of Non-Euclidean Relational Data Using Indiscernibility-Level
In this paper, we present a clustering method for non-Euclidean relational data based on the combination of indiscernibility level and linkage algorithm. Indiscernibility level quantifys the level of global agreement for classifying two objects into the same category as indiscernible objects. Single-linkage grouping is then used to merge objects according to the indiscernibility level from bott...
متن کاملCoastal Typology Development with Heterogeneous Data Sets
This paper presents a data-driven expert-guided method of coastal typology development using a large, heterogeneous data set. The development of coastal typologies is driven by a desire to upscale detailed regional information to a global scale in order to study coastal zone function and the effects of global climate change. We demonstrate two methods of automatic typology generation--unsupervi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015